0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.10 % Command : run_E %s %d THM 0.09/0.30 % Computer : n028.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Tue Aug 9 05:14:35 EDT 2022 0.09/0.30 % CPUTime : 0.14/0.41 Running higher-order on 8 cores theorem proving 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.14/0.41 # Version: 3.0pre003-ho 0.14/0.42 # Preprocessing class: HSMSSMSSMLMNHHN. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.14/0.42 # Starting lpo9_lambda_fix with 120s (1) cores 0.14/0.42 # Starting sh5l with 120s (1) cores 0.14/0.42 # Starting ho_unfolding_6 with 120s (1) cores 0.14/0.42 # lpo9_lambda_fix with pid 30723 completed with status 0 0.14/0.42 # Result found by lpo9_lambda_fix 0.14/0.42 # Preprocessing class: HSMSSMSSMLMNHHN. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.14/0.42 # Starting lpo9_lambda_fix with 120s (1) cores 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000 0.14/0.42 # ...ProofStateSinE()=13/64 0.14/0.42 # Search class: HGHNF-FFMM00-SHHSMFNN 0.14/0.42 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.14/0.42 # Starting new_ho_10 with 65s (1) cores 0.14/0.42 # new_ho_10 with pid 30726 completed with status 0 0.14/0.42 # Result found by new_ho_10 0.14/0.42 # Preprocessing class: HSMSSMSSMLMNHHN. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.14/0.42 # Starting lpo9_lambda_fix with 120s (1) cores 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000 0.14/0.42 # ...ProofStateSinE()=13/64 0.14/0.42 # Search class: HGHNF-FFMM00-SHHSMFNN 0.14/0.42 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.14/0.42 # Starting new_ho_10 with 65s (1) cores 0.14/0.42 # Preprocessing time : 0.001 s 0.14/0.42 # Presaturation interreduction done 0.14/0.42 0.14/0.42 # Proof found! 0.14/0.42 # SZS status Theorem 0.14/0.42 # SZS output start CNFRefutation 0.14/0.42 thf(decl_22, type, meq_ind: mu > mu > $i > $o). 0.14/0.42 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.14/0.42 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.14/0.42 thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.14/0.42 thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.14/0.42 thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.14/0.42 thf(decl_35, type, mtrue: $i > $o). 0.14/0.42 thf(decl_36, type, mfalse: $i > $o). 0.14/0.42 thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.14/0.42 thf(decl_39, type, mreflexive: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_40, type, msymmetric: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_41, type, mserial: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_42, type, mtransitive: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_43, type, meuclidean: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_45, type, mfunctional: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o). 0.14/0.42 thf(decl_49, type, mvalid: ($i > $o) > $o). 0.14/0.42 thf(decl_50, type, minvalid: ($i > $o) > $o). 0.14/0.42 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.14/0.42 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.14/0.42 thf(decl_53, type, epred1_0: $i > $i > $o). 0.14/0.42 thf(decl_54, type, esk1_0: $i). 0.14/0.42 thf(decl_55, type, epred2_0: $i > $o). 0.14/0.42 thf(decl_56, type, epred3_0: $i > $o). 0.14/0.42 thf(decl_57, type, esk2_0: $i). 0.14/0.42 thf(decl_58, type, esk3_0: $i). 0.14/0.42 thf(decl_59, type, esk4_0: $i). 0.14/0.42 thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.14/0.42 thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mnot)). 0.14/0.42 thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mor)). 0.14/0.42 thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mand)). 0.14/0.42 thf(mdia, axiom, ((mdia)=(^[X13:$i > $i > $o, X6:$i > $o]:(mnot @ (mbox @ X13 @ (mnot @ X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mdia)). 0.14/0.42 thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mbox)). 0.14/0.42 thf(mequiv, axiom, ((mequiv)=(^[X6:$i > $o, X7:$i > $o]:(mand @ (mimplies @ X6 @ X7) @ (mimplies @ X7 @ X6)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mequiv)). 0.14/0.42 thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.14/0.42 thf(mforall_prop, axiom, ((mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:(![X10:$i > $o]:((X9 @ X10 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mforall_prop)). 0.14/0.42 thf(conj, conjecture, ![X13:$i > $i > $o]:((mvalid @ (mforall_prop @ (^[X18:$i > $o]:(mforall_prop @ (^[X19:$i > $o]:(mequiv @ (mdia @ X13 @ (mor @ X18 @ X19)) @ (mor @ (mdia @ X13 @ X18) @ (mdia @ X13 @ X19))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)). 0.14/0.42 thf(c_0_10, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.14/0.42 thf(c_0_11, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.14/0.42 thf(c_0_12, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.14/0.42 thf(c_0_13, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.14/0.42 thf(c_0_14, plain, ((mdia)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(~((![X22:$i]:((~((Z0 @ Z2 @ X22))|(~((Z1 @ X22)))))))))), inference(fof_simplification,[status(thm)],[mdia])). 0.14/0.42 thf(c_0_15, plain, ((mbox)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])). 0.14/0.42 thf(c_0_16, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(fof_simplification,[status(thm)],[mequiv])). 0.14/0.42 thf(c_0_17, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10, c_0_11]), c_0_12])). 0.14/0.42 thf(c_0_18, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13, c_0_11]), c_0_12])). 0.14/0.42 thf(c_0_19, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.14/0.42 thf(c_0_20, plain, ((mdia)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(~((![X22:$i]:((~((Z0 @ Z2 @ X22))|(~((Z1 @ X22)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_15]), c_0_11])). 0.14/0.42 thf(c_0_21, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16, c_0_17]), c_0_18])). 0.14/0.42 thf(c_0_22, plain, ((mforall_prop)=(^[Z0:($i > $o) > $i > $o, Z1:$i]:(![X10:$i > $o]:((Z0 @ X10 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_prop])). 0.14/0.42 thf(c_0_23, negated_conjecture, ~(![X13:$i > $i > $o, X28:$i, X27:$i > $o, X26:$i > $o]:(~((~((~(~(![X23:$i]:((~(X13 @ X28 @ X23)|~(((X27 @ X23)|(X26 @ X23)))))))|(~(![X24:$i]:((~(X13 @ X28 @ X24)|~(X27 @ X24))))|~(![X25:$i]:((~(X13 @ X28 @ X25)|~(X26 @ X25)))))))|~((~((~(![X24:$i]:((~(X13 @ X28 @ X24)|~(X27 @ X24))))|~(![X25:$i]:((~(X13 @ X28 @ X25)|~(X26 @ X25))))))|~(![X23:$i]:((~(X13 @ X28 @ X23)|~(((X27 @ X23)|(X26 @ X23)))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_19]), c_0_20]), c_0_12]), c_0_21]), c_0_22])])). 0.14/0.42 thf(c_0_24, negated_conjecture, ![X34:$i, X35:$i, X38:$i]:((((((((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))&((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)))&(((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))&((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))))&((~(epred2_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(epred1_0 @ esk1_0 @ esk2_0))&(~(epred3_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(epred1_0 @ esk1_0 @ esk2_0))))&(((((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)))&((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0))))&(((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)))&((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)))))&((~(epred2_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)))&(~(epred3_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0))))))&((((((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34)))&((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34))))&(((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34)))&((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34)))))&((~(epred2_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34)))&(~(epred3_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(~(epred1_0 @ esk1_0 @ X34)|~(epred2_0 @ X34)))))&(((((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35)))&((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35))))&(((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35)))&((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35)))))&((~(epred2_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35)))&(~(epred3_0 @ X38)|~(epred1_0 @ esk1_0 @ X38)|(~(epred1_0 @ esk1_0 @ X35)|~(epred3_0 @ X35)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])])). 0.14/0.42 thf(c_0_25, negated_conjecture, ![X3:$i, X14:$i]:((~((epred2_0 @ X3))|~((epred1_0 @ esk1_0 @ X3))|~((epred1_0 @ esk1_0 @ X14))|~((epred2_0 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_26, negated_conjecture, ![X3:$i, X14:$i]:((~((epred3_0 @ X3))|~((epred1_0 @ esk1_0 @ X3))|~((epred1_0 @ esk1_0 @ X14))|~((epred3_0 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_27, negated_conjecture, ![X3:$i]:((~((epred1_0 @ esk1_0 @ X3))|~((epred2_0 @ X3)))), inference(condense,[status(thm)],[c_0_25])). 0.14/0.42 thf(c_0_28, negated_conjecture, ((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_29, negated_conjecture, ((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_30, negated_conjecture, ![X3:$i]:((~((epred1_0 @ esk1_0 @ X3))|~((epred3_0 @ X3)))), inference(condense,[status(thm)],[c_0_26])). 0.14/0.42 thf(c_0_31, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_32, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|(epred3_0 @ esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])). 0.14/0.42 thf(c_0_33, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_34, negated_conjecture, ((epred3_0 @ esk4_0)|(epred2_0 @ esk3_0)|(epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_35, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_36, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|(epred2_0 @ esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])). 0.14/0.42 thf(c_0_37, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_38, negated_conjecture, ((epred3_0 @ esk2_0)|(epred2_0 @ esk3_0)|(epred2_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_33]), c_0_34])). 0.14/0.42 thf(c_0_39, negated_conjecture, ((epred3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk3_0)|(epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.14/0.42 thf(c_0_40, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_35]), c_0_36])). 0.14/0.42 thf(c_0_41, negated_conjecture, ((epred1_0 @ esk1_0 @ esk4_0)|(epred3_0 @ esk2_0)|(epred2_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_37]), c_0_38])). 0.14/0.42 thf(c_0_42, negated_conjecture, ((epred3_0 @ esk4_0)|(epred3_0 @ esk2_0)|(epred2_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_39]), c_0_38])). 0.14/0.42 thf(c_0_43, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_40]), c_0_32])). 0.14/0.42 thf(c_0_44, negated_conjecture, ((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_41]), c_0_42])). 0.14/0.42 thf(c_0_45, negated_conjecture, ~((epred2_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_27, c_0_43])). 0.14/0.42 thf(c_0_46, negated_conjecture, (epred3_0 @ esk2_0), inference(sr,[status(thm)],[c_0_44, c_0_45])). 0.14/0.42 thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_43]), c_0_46])]), ['proof']). 0.14/0.42 # SZS output end CNFRefutation 0.14/0.42 # Parsed axioms : 64 0.14/0.42 # Removed by relevancy pruning/SinE : 51 0.14/0.42 # Initial clauses : 24 0.14/0.42 # Removed in clause preprocessing : 0 0.14/0.42 # Initial clauses in saturation : 24 0.14/0.42 # Processed clauses : 57 0.14/0.42 # ...of these trivial : 0 0.14/0.42 # ...subsumed : 7 0.14/0.42 # ...remaining for further processing : 49 0.14/0.42 # Other redundant clauses eliminated : 0 0.14/0.42 # Clauses deleted for lack of memory : 0 0.14/0.42 # Backward-subsumed : 26 0.14/0.42 # Backward-rewritten : 5 0.14/0.42 # Generated clauses : 30 0.14/0.42 # ...of the previous two non-redundant : 31 0.14/0.42 # ...aggressively subsumed : 0 0.14/0.42 # Contextual simplify-reflections : 9 0.14/0.42 # Paramodulations : 29 0.14/0.42 # Factorizations : 0 0.14/0.42 # NegExts : 0 0.14/0.42 # Equation resolutions : 0 0.14/0.42 # Propositional unsat checks : 0 0.14/0.42 # Propositional check models : 0 0.14/0.42 # Propositional check unsatisfiable : 0 0.14/0.42 # Propositional clauses : 0 0.14/0.42 # Propositional clauses after purity: 0 0.14/0.42 # Propositional unsat core size : 0 0.14/0.42 # Propositional preprocessing time : 0.000 0.14/0.42 # Propositional encoding time : 0.000 0.14/0.42 # Propositional solver time : 0.000 0.14/0.42 # Success case prop preproc time : 0.000 0.14/0.42 # Success case prop encoding time : 0.000 0.14/0.42 # Success case prop solver time : 0.000 0.14/0.42 # Current number of processed clauses : 7 0.14/0.42 # Positive orientable unit clauses : 4 0.14/0.42 # Positive unorientable unit clauses: 0 0.14/0.42 # Negative unit clauses : 1 0.14/0.42 # Non-unit-clauses : 2 0.14/0.42 # Current number of unprocessed clauses: 0 0.14/0.42 # ...number of literals in the above : 0 0.14/0.42 # Current number of archived formulas : 0 0.14/0.42 # Current number of archived clauses : 42 0.14/0.42 # Clause-clause subsumption calls (NU) : 74 0.14/0.42 # Rec. Clause-clause subsumption calls : 47 0.14/0.42 # Non-unit clause-clause subsumptions : 40 0.14/0.42 # Unit Clause-clause subsumption calls : 6 0.14/0.42 # Rewrite failures with RHS unbound : 0 0.14/0.42 # BW rewrite match attempts : 3 0.14/0.42 # BW rewrite match successes : 3 0.14/0.42 # Condensation attempts : 57 0.14/0.42 # Condensation successes : 2 0.14/0.42 # Termbank termtop insertions : 2982 0.14/0.42 0.14/0.42 # ------------------------------------------------- 0.14/0.42 # User time : 0.004 s 0.14/0.42 # System time : 0.003 s 0.14/0.42 # Total time : 0.008 s 0.14/0.42 # Maximum resident set size: 1924 pages 0.14/0.42 0.14/0.42 # ------------------------------------------------- 0.14/0.42 # User time : 0.005 s 0.14/0.42 # System time : 0.006 s 0.14/0.42 # Total time : 0.011 s 0.14/0.42 # Maximum resident set size: 1796 pages 0.14/0.42 EOF